A characterization of sub-game perfect Nash equilibria for SDEs of mean field type

نویسندگان

  • Boualem Djehiche
  • Minyi Huang
چکیده

We study a class of dynamic decision problems of mean field type with time inconsistent cost functionals, and derive a stochastic maximum principle to characterize subgame perfect Nash equilibrium points. Subsequently, this approach is extended to a mean field game to construct decentralized strategies and obtain an estimate of their performance.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Characterization of Sub-game Perfect Equilibria for SDEs of Mean-Field Type

We study a class of dynamic decision problems of mean field type with time inconsistent cost functionals, and derive a stochastic maximum principle to characterize subgame perfect equilibrium points. Subsequently, this approach is extended to a mean field game to construct decentralized strategies and obtain an estimate of their performance.

متن کامل

Nash Equilibria for Stochastic Games with Asymmetric Information-Part 1: Finite Games

A model of stochastic games where multiple controllers jointly control the evolution of the state of a dynamic system but have access to different information about the state and action processes is considered. The asymmetry of information among the controllers makes it difficult to compute or characterize Nash equilibria. Using common information among the controllers, the game with asymmetric...

متن کامل

Dynamical selection of Nash equilibria using Experience Weighted Attraction Learning: emergence of heterogeneous mixed equilibria

We study the distribution of strategies in a large game that models how agents choose among different double auction markets. We classify the possible mean field Nash equilibria, which include potentially segregated states where an agent population can split into subpopulations adopting different strategies. As the game is aggregative, the actual equilibrium strategy distributions remain undete...

متن کامل

Two-Timescale Algorithms for Learning Nash Equilibria in General-Sum Stochastic Games

We consider the problem of finding stationary Nash equilibria (NE) in a finite discounted general-sum stochastic game. We first generalize a non-linear optimization problem from [9] to a general N player game setting. Next, we break down the optimization problem into simpler sub-problems that ensure there is no Bellman error for a given state and an agent. We then provide a characterization of ...

متن کامل

Supplement to “ Majority runoff elections : Strategic voting and Duverger ’ s hypothesis ” : Technical appendices

In Appendix C, for a large class of Poisson games, we define Bayes–Nash equilibrium and extend the definition of strictly perfect equilibrium (Okada 1981). We show some useful properties of Nash equilibria and we characterize the set of strictly perfect equilibria. We define a limit property of Nash equilibria as the number of players grows large: asymptotic strict perfection. Our characterizat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014